An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
نویسندگان
چکیده
Most probabilistic programming languages for Bayesian inference give either operational semantics in terms of sampling, or denotational semantics in terms of measure-theoretic distributions. It is important that we can relate the two, given that practitioners often reason both analytically (e.g., density) as well as algorithmically (i.e., in terms of sampling) about distributions. In this paper, we give denotational semantics to a functional language extended with continuous distributions and show that by restricting attention to computable distributions, we can realize a corresponding sampling semantics.
منابع مشابه
An application of computable distributions to the semantics of probabilistic programs
In this extended abstract, we give semantics to a core functional probabilistic programming language (PCF with pairs) based on computable distributions. Type-2 computable distributions admit Type-2 computable sampling procedures. Informally, this means that we can sample from every computable distribution using a sampling algorithm that operates on input bit-randomness (e.g., a stream of fair c...
متن کاملA programming approach to computability pdf
A Programming Approach to Computability. Enumeration and Universality of the Computable Functions. 4 The FOR in real programming languages. Computability and complexity are in some way the basics of what computer science is about.Computability and Complexity: From a Programming Perspective, Neil D. 1Dana Scott was an early proponent of programming approach to automata.Computability unit of the ...
متن کاملDeclarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کاملProbabilistic Programming Concepts
A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of complex, structured probability distributions. Each of these languages employs its own probabilistic primitives, and comes with a particular syntax, semantics and inference procedure. This makes it hard to understand the underlying pr...
متن کاملFull abstraction for probabilistic PCF
We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-byname, we allow a call-by-value evaluation for ground type arguments in order to provide the language with a suitable algorithmic expressiveness. We describe a denotational semantics bas...
متن کامل